Time Encoding via Unlimited Sampling: Theory, Algorithms and Hardware Validation

نویسندگان

چکیده

An alternative to conventional uniform sampling is that of time encoding, which converts continuous-time signals into streams trigger times. This gives rise Event-Driven Sampling (EDS) models. The data-driven nature EDS acquisition advantageous in terms power consumption and resolution inspired by the information representation biological nervous systems. If an analog signal outside a predefined dynamic range, then generates low density times, turn leads recovery distortion due aliasing. In this paper, Unlimited Sensing Framework (USF), we propose new architecture incorporates modulo nonlinearity prior refer as or MEDS. MEDS, folds high range inputs amplitudes, thus avoiding distortion. particular, consider asynchronous sigma-delta modulator (ASDM), previously used for analog-to-digital conversion. novel MEDS based enabled recent generalization called modulo-hysteresis. We design mathematically guaranteed algorithm bandlimited on rate criterion provide reconstruction error bounds. go beyond numerical experiments also first hardware validation our approach, bridging gap between theory practice, while corroborating conceptual underpinnings work.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validation Methods and Fuzzy Set Theory: Theory, Algorithms and Application

The idea of validation arises naturally within the context of interval analysis where the theory and methods are well developed. Approaching fuzzy set theory through fuzzy interval analysis, we develop a validation theory for fuzzy sets. An algorithm is given and applied to an optimization problem.

متن کامل

Faster Algorithms via Approximation Theory

This monograph presents ideas and techniques from approximation theory for approximating functions such as xs, x−1 and e−x, and demonstrates how these results play a crucial role in the design of fast algorithms for problems which are increasingly relevant. The key lies in the fact that such results imply faster ways to compute primitives such as Asv, A−1v, exp(−A)v, eigenvalues, and eigenvecto...

متن کامل

Polynomial time algorithms for dual volume sampling

We study dual volume sampling, a method for selecting k columns from an n⇥m short and wide matrix (n  k  m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method was proposed by Avron and Boutsidis (2013), who showed it to be a promising method for column subset selection and its multiple applications. However, its wider...

متن کامل

Space-time adaptive image representations: Data Structures, Hardware and Algorithms

Simultuaneous spatial identification and rapid tracking of moving objects is difficult with conventional video formats, which do not have enough space-time bandwidth. Increasing the spatial or temporal sampling rates tends to run into problems with available light and/or with inundating computational and communication channels with to much data. In this paper, we explore alternate sensing strat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3210748